Formalising the pi-calculus using nominal logic
نویسندگان
چکیده
منابع مشابه
Formalising the pi-Calculus Using Nominal Logic
We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to conduct machine checkable proofs, closely following the intuitive arguments found in manual proofs. In this way we have covered many of the standa...
متن کاملFormalising the π-calculus using Nominal Logic
We formalise the pi-calculus using the nominal datatype package, a package based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to conduct machine checkable proofs, closely following the intuitive arguments found in manual proofs. In this way we have covered many of ...
متن کاملFormalising privacy-type security properties using the applied pi calculus
Privacy is a general requirement that needs to be studied in di↵erent contexts. We identify some applications for wich privacy plays an important role, and with significant interest in terms of societal impact. Since each application leads to several definitions of privacy, and raise some particular modelling issues, we concentrate our e↵orts on the three following applications: electronic voti...
متن کاملEpistemic Logic for the Applied Pi Calculus
We propose an epistemic logic for the applied pi calculus, which is a variant of the pi calculus with extensions for modeling cryptographic protocols. In such a calculus, the security guarantees are usually stated as equivalences. While process calculi provide a natural means to describe the protocols themselves, epistemic logics are often better suited for expressing certain security propertie...
متن کاملA simple sequent calculus for nominal logic
Nominal logic is a variant of first-order logic that provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values considered so far). Previous attempts have been made to develop convenient rules for reasoning with the new-quantifier, but we argue that none of these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2009
ISSN: 1860-5974
DOI: 10.2168/lmcs-5(2:16)2009